Search Results

Documents authored by Palmieri, Roberto

Document
Complete Volume
DOI: 10.4230/LIPIcs.OPODIS.2022
LIPIcs, Volume 253, OPODIS 2022, Complete Volume

Authors: Eshcar Hillel, Roberto Palmieri, and Etienne Rivière

Published in: LIPIcs, Volume 253, 26th International Conference on Principles of Distributed Systems (OPODIS 2022)

Abstract
LIPIcs, Volume 253, OPODIS 2022, Complete Volume
Cite as

26th International Conference on Principles of Distributed Systems (OPODIS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 253, pp. 1-536, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Proceedings{hillel_et_al:LIPIcs.OPODIS.2022,
  title =	{{LIPIcs, Volume 253, OPODIS 2022, Complete Volume}},
  booktitle =	{26th International Conference on Principles of Distributed Systems (OPODIS 2022)},
  pages =	{1--536},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-265-5},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{253},
  editor =	{Hillel, Eshcar and Palmieri, Roberto and Rivi\`{e}re, Etienne},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2022},
  URN =		{urn:nbn:de:0030-drops-176190},
  doi =		{10.4230/LIPIcs.OPODIS.2022},
  annote =	{Keywords: LIPIcs, Volume 253, OPODIS 2022, Complete Volume}
}
Document
Front Matter
DOI: 10.4230/LIPIcs.OPODIS.2022.0
Front Matter, Table of Contents, Preface, Conference Organization

Authors: Eshcar Hillel, Roberto Palmieri, and Etienne Rivière

Published in: LIPIcs, Volume 253, 26th International Conference on Principles of Distributed Systems (OPODIS 2022)

Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as

26th International Conference on Principles of Distributed Systems (OPODIS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 253, pp. 0:i-0:xiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{hillel_et_al:LIPIcs.OPODIS.2022.0,
  author =	{Hillel, Eshcar and Palmieri, Roberto and Rivi\`{e}re, Etienne},
  title =	{{Front Matter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{26th International Conference on Principles of Distributed Systems (OPODIS 2022)},
  pages =	{0:i--0:xiv},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-265-5},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{253},
  editor =	{Hillel, Eshcar and Palmieri, Roberto and Rivi\`{e}re, Etienne},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2022.0},
  URN =		{urn:nbn:de:0030-drops-176203},
  doi =		{10.4230/LIPIcs.OPODIS.2022.0},
  annote =	{Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Brief Announcement
DOI: 10.4230/LIPIcs.DISC.2022.50
Brief Announcement: Asymmetric Mutual Exclusion for RDMA

Authors: Jacob Nelson-Slivon, Lewis Tseng, and Roberto Palmieri

Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)

Abstract
In this brief announcement, we define operation asymmetry, which captures how processes may interact with an object differently, and discuss its implications in the context of a popular network communication technology, remote direct memory access (RDMA). Then, we present a novel approach to mutual exclusion for RDMA-based distributed synchronization under operation asymmetry. Our approach avoids RDMA loopback for local processes and guarantees starvation-freedom and fairness.
Cite as

Jacob Nelson-Slivon, Lewis Tseng, and Roberto Palmieri. Brief Announcement: Asymmetric Mutual Exclusion for RDMA. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 50:1-50:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{nelsonslivon_et_al:LIPIcs.DISC.2022.50,
  author =	{Nelson-Slivon, Jacob and Tseng, Lewis and Palmieri, Roberto},
  title =	{{Brief Announcement: Asymmetric Mutual Exclusion for RDMA}},
  booktitle =	{36th International Symposium on Distributed Computing (DISC 2022)},
  pages =	{50:1--50:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-255-6},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{246},
  editor =	{Scheideler, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.50},
  URN =		{urn:nbn:de:0030-drops-172417},
  doi =		{10.4230/LIPIcs.DISC.2022.50},
  annote =	{Keywords: Mutual exclusion, Synchronization, Remote direct memory access (RDMA)}
}
Document
DOI: 10.4230/LIPIcs.OPODIS.2019.10
HaTS: Hardware-Assisted Transaction Scheduler

Authors: Zhanhao Chen, Ahmed Hassan, Masoomeh Javidi Kishi, Jacob Nelson, and Roberto Palmieri

Published in: LIPIcs, Volume 153, 23rd International Conference on Principles of Distributed Systems (OPODIS 2019)

Abstract
In this paper we present HaTS, a Hardware-assisted Transaction Scheduler. HaTS improves performance of concurrent applications by classifying the executions of their atomic blocks (or in-memory transactions) into scheduling queues, according to their so called conflict indicators. The goal is to group those transactions that are conflicting while letting non-conflicting transactions proceed in parallel. Two core innovations characterize HaTS. First, HaTS does not assume the availability of precise information associated with incoming transactions in order to proceed with the classification. It relaxes this assumption by exploiting the inherent conflict resolution provided by Hardware Transactional Memory (HTM). Second, HaTS dynamically adjusts the number of the scheduling queues in order to capture the actual application contention level. Performance results using the STAMP benchmark suite show up to 2x improvement over state-of-the-art HTM-based scheduling techniques.
Cite as

Zhanhao Chen, Ahmed Hassan, Masoomeh Javidi Kishi, Jacob Nelson, and Roberto Palmieri. HaTS: Hardware-Assisted Transaction Scheduler. In 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 153, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{chen_et_al:LIPIcs.OPODIS.2019.10,
  author =	{Chen, Zhanhao and Hassan, Ahmed and Kishi, Masoomeh Javidi and Nelson, Jacob and Palmieri, Roberto},
  title =	{{HaTS: Hardware-Assisted Transaction Scheduler}},
  booktitle =	{23rd International Conference on Principles of Distributed Systems (OPODIS 2019)},
  pages =	{10:1--10:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-133-7},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{153},
  editor =	{Felber, Pascal and Friedman, Roy and Gilbert, Seth and Miller, Avery},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2019.10},
  URN =		{urn:nbn:de:0030-drops-117965},
  doi =		{10.4230/LIPIcs.OPODIS.2019.10},
  annote =	{Keywords: Transactions, Scheduling, Hardware Transactional Memory}
}
Document
Brief Announcement
DOI: 10.4230/LIPIcs.DISC.2019.46
Brief Announcement: On the Correctness of Transaction Processing with External Dependency

Authors: Masoomeh Javidi Kishi, Ahmed Hassan, and Roberto Palmieri

Published in: LIPIcs, Volume 146, 33rd International Symposium on Distributed Computing (DISC 2019)

Abstract
We briefly introduce a unified model to characterize correctness levels stronger (or equal to) serializability in the presence of application invariant. We propose to classify relations among committed transactions into data-related and application semantic-related. Our model delivers a condition that can be used to verify the safety of transactional executions in the presence of application invariant.
Cite as

Masoomeh Javidi Kishi, Ahmed Hassan, and Roberto Palmieri. Brief Announcement: On the Correctness of Transaction Processing with External Dependency. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 46:1-46:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{javidikishi_et_al:LIPIcs.DISC.2019.46,
  author =	{Javidi Kishi, Masoomeh and Hassan, Ahmed and Palmieri, Roberto},
  title =	{{Brief Announcement: On the Correctness of Transaction Processing with External Dependency}},
  booktitle =	{33rd International Symposium on Distributed Computing (DISC 2019)},
  pages =	{46:1--46:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-126-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{146},
  editor =	{Suomela, Jukka},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.46},
  URN =		{urn:nbn:de:0030-drops-113539},
  doi =		{10.4230/LIPIcs.DISC.2019.46},
  annote =	{Keywords: Transactions, Dependency Graph, Concurrency}
}
Document
DOI: 10.4230/LIPIcs.DISC.2018.18
NUMASK: High Performance Scalable Skip List for NUMA

Authors: Henry Daly, Ahmed Hassan, Michael F. Spear, and Roberto Palmieri

Published in: LIPIcs, Volume 121, 32nd International Symposium on Distributed Computing (DISC 2018)

Abstract
This paper presents NUMASK, a skip list data structure specifically designed to exploit the characteristics of Non-Uniform Memory Access (NUMA) architectures to improve performance. NUMASK deploys an architecture around a concurrent skip list so that all metadata accesses (e.g., traversals of the skip list index levels) read and write memory blocks allocated in the NUMA zone where the thread is executing. To the best of our knowledge, NUMASK is the first NUMA-aware skip list design that goes beyond merely limiting the performance penalties introduced by NUMA, and leverages the NUMA architecture to outperform state-of-the-art concurrent high-performance implementations. We tested NUMASK on a four-socket server. Its performance scales for both read-intensive and write-intensive workloads (tested up to 160 threads). In write-intensive workload, NUMASK shows speedups over competitors in the range of 2x to 16x.
Cite as

Henry Daly, Ahmed Hassan, Michael F. Spear, and Roberto Palmieri. NUMASK: High Performance Scalable Skip List for NUMA. In 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 121, pp. 18:1-18:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{daly_et_al:LIPIcs.DISC.2018.18,
  author =	{Daly, Henry and Hassan, Ahmed and Spear, Michael F. and Palmieri, Roberto},
  title =	{{NUMASK: High Performance Scalable Skip List for NUMA}},
  booktitle =	{32nd International Symposium on Distributed Computing (DISC 2018)},
  pages =	{18:1--18:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-092-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{121},
  editor =	{Schmid, Ulrich and Widder, Josef},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.18},
  URN =		{urn:nbn:de:0030-drops-98076},
  doi =		{10.4230/LIPIcs.DISC.2018.18},
  annote =	{Keywords: Skip list, NUMA, Concurrent Data Structure}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact